An upper bound for topological complexity
نویسندگان
چکیده
منابع مشابه
An Upper Bound for the Complexity of Transformation Semigroups
A transformation semigroup (ts) X = (Q,, S,) in this paper consists of a finite set of states Qx and a subsemigroup of transformations S, of PF(Q,), the monoid of all partial functions on Q, with composition as multiplication. For n > 1, ii’ denotes the transformation monoid (tm) with n states and with the n constant maps on those n states (along with the identity function) as transformations. ...
متن کاملAn upper bound on the complexity of recognizable tree languages
The third author noticed in his 1992 PhD Thesis [Sim92] that every regular tree language of infinite trees is in a class a(Dn(Σ2)) for some natural number n ≥ 1, where a is the game quantifier. We first give a detailed exposition of this result. Next, using an embedding of the Wadge hierarchy of non self-dual Borel subsets of the Cantor space 2 into the class ∆2, and the notions of Wadge degree...
متن کاملAn Upper Bound Analysis of Sandwich Sheet Rolling Process
In this research, flat rolling process of bonded sandwich sheets is investigated by the method of upper bound. A kinematically admissible velocity field is developed for a single layer sheet and is extended into the rolling of the symmetrical sandwich sheets. The internal, shear and frictional power terms are derived and they are used in the upper bound model. Through the analysis, the rolling ...
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2019
ISSN: 0166-8641
DOI: 10.1016/j.topol.2019.01.007